Reconstruction and verification of group membership protocols
نویسندگان
چکیده
In this paper, we present a process-algebraic specification of group membership protocols specified in [Y. Amir, D. Dolev, S. Kramer and D. Malki, Membership Algorithms for Multicast Communication Groups, Springer-Verlag, 1992]. In order to formalise the protocol and its properties we disambiguate the informal specification provided by the paper. This requires trying different possible interpretations in the formal model and checking the consistency of the assumption and formally verifying the correctness properties. We thus present a formal reconstruction of the membership algorithms and model-check our reconstruction.
منابع مشابه
Model-Checking a Group Membership Protocol for TDMA-based Networks with both Static and Dynamic Scheduling
We report ongoing work on a group membership protocol specially designed to take advantage of the support of both static and dynamic scheduling in new TDMA-based protocols being proposed for safety critical applications, such as Flex-Ray. In contrast with previous group membership protocols for TDMA-based networks, ours does not require the pre-allocation of group membership traffic in every cy...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملFormal Verification of an Intrusion-Tolerant Group Membership Protocol∗
The traditional approach for establishing the correctness of group communication protocols is through rigorous arguments. While this is a valid approach, the likelihood of subtle errors in the design and implementation of such complex distributed protocols is not negligible. The use of formal verification methods has been widely advocated to instill confidence in the correctness of protocols. I...
متن کاملComparing IDREAM as an Iterative Reconstruction Algorithm against In Filtered Back Projection in Computed Tomography
Introduction: Recent studies of Computed Tomography (CT) conducted on patient dose reduction have recommended using an iterative reconstruction algorithm and mA (mili-Ampere) dose modulation. The current study aimed to evaluate Iterative Dose Reduction Algorithm (IDREAM) as an iterative reconstruction algorithm. Material and Methods: Two CT p...
متن کاملGroup membership protocol: specification and verification
According to the Evolving Algebra thesis [3], evolving algebras should allow one to specify succinctly any algorithm. There exists substantial evidence con rming this thesis in the case of sequential algorithms (see the annotated bibliography in [3]). In other papers, e.g., [1, 5], evolving algebras are used to specify distributed algorithms. For this paper, we wanted to look at a time-constrai...
متن کامل